Genetic algorithm for planning cable telecommunication networks
نویسندگان
چکیده
منابع مشابه
A.I. Techniques for Planning Telecommunication Networks
The planning of investments when building and upgrading communication networks amounts to notoriously difficult combinatorial problems. Solving these issues can not be done in a straightforward way within a reasonable calculation time, despite the ever-growing computational power of computers and the flexible off-line character of network planning. In this paper, an overview is given of the mea...
متن کامل3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملEugenic Algorithm for Routing of Multipoint Connections in Telecommunication Networks
This contribution deals with routing of Multipoint connections in telecommunication networks using Eugenic algorithm. Telecommunication network is represented by undirected graph. Proposed algorithm uses matrix bit representation of individual.
متن کاملA Tabu Search algorithm for the optimisation of telecommunication networks
A Tabu Search (TS) algorithm is presented for topological optimisation of broad band communication networks whose structure is based on a single exchange and on a number of multiplexing centres. Considering the high cost of the ®ber optic cable, the network architecture is a minimum spanning tree. The optimisation problem is reduced to choose the number and the locations of the multiplexing cen...
متن کاملA bundle-type algorithm for routing in telecommunication data networks
To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest paths problems) and of a smooth function (coming from the congestion). Key-words: Convex optimization, routing, multico...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2001
ISSN: 1568-4946
DOI: 10.1016/s1568-4946(01)00004-7